Bounds for binary codes relative to pseudo-distances of k points
نویسندگان
چکیده
We apply Schrijver’s semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
منابع مشابه
Bounds on sets with few distances
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: • we improve the Ray-Chaudhuri–Wilson bound of the size of uniform intersecting families of subsets; • we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; • we prove a new bound on codes with few dista...
متن کاملA bound on l1 codes
We give reasonably tight bounds on the maximal number of points in the unit ball of l1 with pairwise distances at least 2− ε, for a small parameter ε. The same result was obtained independently and somewhat earlier by Lee and Moharrami (see [2], where it is stated in terms of metric embeddings). Our approach seems to be different, in that we essentially reduce the problem to the question of exi...
متن کاملOn Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملMultilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 4 شماره
صفحات -
تاریخ انتشار 2010